Least fixed point of a functor
نویسندگان
چکیده
منابع مشابه
Lattice based Least Fixed Point Logic
As software systems become more complex, there is an increasing need for new static analyses. Thanks to the declarative style, logic programming is an attractive formalism for specifying them. However, prior work on using logic programming for static analysis focused on analyses defined over some powerset domain, which is quite limiting. In this paper we present a logic that lifts this restrict...
متن کاملA Characterisation of the Least-Fixed-Point Operator by Dinaturality
Simpson, A.K., A characterisation of the least-fixed-point operator by dinaturality, Theoretical Computer Science 118 (1993) 301-314. The paper addresses the question of when the least-fixed-point operator, in a Cartesian-closed category of domains, is characterised as the unique dinatural transformation from the exponentiation bifunctor to the identity functor. We give a sufficient condition o...
متن کاملA note on negative tagging for least fixed-point formulae
We consider proof systems with sequents of the form U for proving validity of a propositional modal calculus formula over a set U of states in a given model Such proof systems usually handle xed point formulae through unfolding thus allowing such formulae to reappear in a proof Tagging is a technique originated by Winskel for annotating xed point formulae with information about the proof states...
متن کاملComputing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector form we denote such an equation system by X = f(X) and call f a system of positive polynomials, short SPP. Equation systems of this kind appear naturally in the analysis of stochastic models like stochastic context-free...
متن کاملCompositional model checking of monadic least fixed point logic
Compositional model checking refers to reducing the problem of model checking some property of the whole system to the problem of model checking its components. In this paper, we investigate compositional approach for model checking monadic least fixed point logic on transition systems assembled from the components by using the H-sum and the fusion operator. 1 Research Area – Main Themes The ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1979
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90026-6